33 research outputs found
The impact of Stieltjes' work on continued fractions and orthogonal polynomials
Stieltjes' work on continued fractions and the orthogonal polynomials related
to continued fraction expansions is summarized and an attempt is made to
describe the influence of Stieltjes' ideas and work in research done after his
death, with an emphasis on the theory of orthogonal polynomials
The Borwein brothers, Pi and the AGM
We consider some of Jonathan and Peter Borweins' contributions to the
high-precision computation of and the elementary functions, with
particular reference to their book "Pi and the AGM" (Wiley, 1987). Here "AGM"
is the arithmetic-geometric mean of Gauss and Legendre. Because the AGM
converges quadratically, it can be combined with fast multiplication algorithms
to give fast algorithms for the -bit computation of , and more
generally the elementary functions. These algorithms run in almost linear time
, where is the time for -bit multiplication. We
outline some of the results and algorithms given in Pi and the AGM, and present
some related (but new) results. In particular, we improve the published error
bounds for some quadratically and quartically convergent algorithms for ,
such as the Gauss-Legendre algorithm. We show that an iteration of the
Borwein-Borwein quartic algorithm for is equivalent to two iterations of
the Gauss-Legendre quadratic algorithm for , in the sense that they
produce exactly the same sequence of approximations to if performed using
exact arithmetic.Comment: 24 pages, 6 tables. Changed style file and reformatted algorithms in
v
On the complexity of arithmetic secret sharing
Since the mid 2000s, asymptotically-good strongly-multiplicative linear (ramp) secret sharing schemes over a fixed finite field have turned out as a central theoretical primitive in numerous constant-communication-rate results in multi-party cryptographic scenarios, and, surprisingly, in two-party cryptography as well. Known constructions of this most powerful class of arithmetic secret sharing schemes all rely heavily on algebraic geometry (AG), i.e., on dedicated AG codes based on asymptotically good towers of algebraic function fields defined over finite fields. It is a well-known open question since the first (explicit) constructions of such schemes appeared in CRYPTO 2006 whether the use of âheavy machineryâ can be avoided here. i.e., the question is whether the mere existence of such schemes can also be proved by âelementaryâ techniques only (say, from classical algebraic coding theory), even disregarding effective construction. So far, there is no progress. In this paper we show the theoretical result that, (1) no matter whether this open question has an affirmative answer or not, these schemes can be constructed explicitly by elementary algorithms defined in terms of basic algebraic coding theory. This pertains to all relevant operations associated to such schemes, including, notably, the generation of an instance for a given number of players n, as well as error correction in the presence of corrupt shares. We further show that (2) the algorithms are quasi-linear time (in n); this is (asymptotically) significantly more efficient than the known constructions. That said, the analysis of the mere termination of these algorithms does still rely on algebraic geometry, in the sense that it requires âblackbox applicationâ of suitable existence results for these schemes. Our method employs a nontrivial, novel adaptation of a classical (and ubiquitous) paradigm from coding theory that enables transformation of existence results on asymptotically good codes into explicit construction of such codes via concatenation, at some constant loss in parameters achieved. In a nutshell, our generating idea is to combine a cascade of explicit but âasymptotically-bad-yet-good-enough schemesâ with an asymptotically good one in such a judicious way that the latter can be selected with exponentially small number of players in that of the compound scheme. This opens the door t
Secure Computation using Leaky Correlations (Asymptotically Optimal Constructions)
Most secure computation protocols can be effortlessly adapted to offload a significant fraction of their computationally and cryptographically expensive components to an offline phase so that the parties can run a fast online phase and perform their intended computation securely. During this offline phase, parties generate private shares of a sample generated from a particular joint distribution, referred to as the correlation. These shares, however, are susceptible to leakage attacks by adversarial parties, which can compromise the security of the entire secure computation protocol. The objective, therefore, is to preserve the security of the honest party despite the leakage performed by the adversary on her share.
Prior solutions, starting with -bit leaky shares, either used 4 messages or enabled the secure computation of only sub-linear size circuits. Our work presents the first 2-message secure computation protocol for 2-party functionalities that have circuit-size despite -bits of leakage, a qualitatively optimal result. We compose a suitable 2-message secure computation protocol in parallel with our new 2-message correlation extractor. Correlation extractors, introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai (FOCS--2009) as a natural generalization of privacy amplification and randomness extraction, recover ``fresh\u27\u27 correlations from the leaky ones, which are subsequently used by other cryptographic protocols. We construct the first 2-message correlation extractor that produces -bit fresh correlations even after -bit leakage.
Our principal technical contribution, which is of potential independent interest, is the construction of a family of multiplication-friendly linear secret sharing schemes that is simultaneously a family of small-bias distributions. We construct this family by randomly ``twisting then permuting\u27\u27 appropriate Algebraic Geometry codes over constant-size fields
Computing supersingular isogenies on Kummer surfaces
We apply Scholten\u27s construction to give explicit isogenies between the Weil restriction of supersingular Montgomery curves with full rational 2-torsion over and corresponding abelian surfaces over . Subsequently, we show that isogeny-based public key cryptography can exploit the fast Kummer surface arithmetic that arises from the theory of theta functions. In particular, we show that chains of 2-isogenies between elliptic curves can instead be computed as chains of Richelot (2,2)-isogenies between Kummer surfaces. This gives rise to new possibilities for efficient supersingular isogeny-based cryptography
Secure Computation with Constant Communication Overhead using Multiplication Embeddings
Secure multi-party computation (MPC) allows mutually distrusting parties to compute securely over their private data.
The hardness of MPC, essentially, lies in performing secure multiplications over suitable algebras. Parties use diverse cryptographic resources, like computational hardness assumptions or physical resources, to securely compute these multiplications.
There are several cryptographic resources that help securely compute one multiplication over a large finite field, say , with linear communication complexity. For example, the computational hardness assumption like noisy Reed-Solomon codewords are pseudorandom. However, it is not known if we can securely compute, say, a linear number of AND-gates from such resources, i.e., a linear number of multiplications over the base field . Before our work, we could only perform secure AND-evaluations. This example highlights the general inefficiency of multiplying over the base field using one multiplication over the extension field. Our objective is to remove this hurdle and enable secure computation of boolean circuits while incurring a constant communication overhead based on more diverse cryptographic resources.
Technically, we construct a perfectly secure protocol that realizes a linear number of multiplication gates over the base field using one multiplication gate over a degree- extension field. This construction relies on the toolkit provided by algebraic function fields.
Using this construction, we obtain the following results.
If we can perform one multiplication over with linear communication using a particular cryptographic resource, then we can also evaluate linear-size boolean circuits with linear communication using the same cryptographic resource. In particular, we provide the first construction that computes a linear number of oblivious transfers with linear communication complexity from the computational hardness assumptions like noisy Reed-Solomon codewords are pseudorandom, or arithmetic-analogues of LPN-style assumptions. Next, we highlight the potential of our result for other applications to MPC by constructing the first correlation extractor that has resilience and produces a linear number of oblivious transfers
On the algebraicity of Puiseux series
We deal with the algebraicity of a Puiseux series in terms of the properties
of its coefficients. We show that the algebraicity of a Puiseux series for
given bounded degree is determined by a finite number of explicit polynomial
formulae. Conversely, given a vanishing polynomial, there is a closed-form
formula for the coefficients of the series in terms of the coefficients of the
polynomial and of an initial part of the series.Comment: 19 page